Lower Bounds for Polynomials Using Geometric Programming
نویسندگان
چکیده
منابع مشابه
Lower Bounds for Polynomials Using Geometric Programming
We make use of a result of Hurwitz and Reznick [8] [19], and a consequence of this result due to Fidalgo and Kovacec [5], to determine a new sufficient condition for a polynomial f ∈ R[X1, . . . , Xn] of even degree to be a sum of squares. This result generalizes a result of Lasserre in [10] and a result of Fidalgo and Kovacec in [5], and it also generalizes the improvements of these results gi...
متن کاملLower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares representation. These criteria rely on the coefficients and the support of a polynomial and generalize all previous ones by Lasserre, Ghasemi, Marshall, Fidalgo and Ko...
متن کاملLower Bounds Using Dual Polynomials ∗
Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x 1 ,. .. , x n) that approximates or sign-represents a given Boolean function f (x 1 ,. .. , x n). This article surveys a new and growing body of work in communication complexity that centers around the dual objects, i.e., poly...
متن کاملCircuit Lower Bounds for Parity Using Polynomials
Before we talk about bounds on the size of a circuit, let us first clarify what we mean by circuit depth and circuit size. The depth of a circuit is defined as the length of the longest path from the input to output. The size of a circuit is the number of AND and OR gates in the circuit. Note that, for our purpose, we assume all the gates have unlimited fan-in and fan-out. We define AC0 to be t...
متن کاملCommunication Lower Bounds Using Dual Polynomials
Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x1, . . . , xn) that approximates or sign-represents a given Boolean function f (x1, . . . , xn). This article surveys a new and growing body of work in communication complexity that centers around the dual objects, i.e., polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2012
ISSN: 1052-6234,1095-7189
DOI: 10.1137/110836869